ANOVA decomposition of convex piecewise linear functions
نویسنده
چکیده
Piecewise linear convex functions arise as integrands in stochastic programs. They are Lipschitz continuous on their domain, but do not belong to tensor product Sobolev spaces. Motivated by applying Quasi-Monte Carlo methods we show that all terms of their ANOVA decomposition, except the one of highest order, are smooth if the underlying densities are smooth and a certain geometric condition is satisfied. The latter condition is generically satisfied in the normal case.
منابع مشابه
A new algorithm for solving Van der Pol equation based on piecewise spectral Adomian decomposition method
In this article, a new method is introduced to give approximate solution to Van der Pol equation. The proposed method is based on the combination of two different methods, the spectral Adomian decomposition method (SADM) and piecewise method, called the piecewise Adomian decomposition method (PSADM). The numerical results obtained from the proposed method show that this method is an...
متن کاملHigh order structural image decomposition by using non-linear and non-convex regularizing objectives
The paper addresses structural decomposition of images by using a family of non-linear and non-convex objective functions. These functions rely on `p quasi-norm estimation costs in a piecewise constant regularization framework. These objectives make image decomposition into constant cartoon levels and rich textural patterns possible. The paper shows that these regularizing objectives yield imag...
متن کاملAnalysis of Piecewise Linear Systems via Convex Optimization – a Unifying Approach
The recently developed technique for computation of piecewise quadratic Lyapunov functions is specialized to Lyapunov functions that are piecewise linear. This establishes a unified framework for computation of quadratic, piecewise quadratic, piecewise linear and polytopic Lyapunov functions. The search for a piecewise linear Lyapunov function is formulated as a linear programming problem, and ...
متن کاملOn Computing the Convex Hull of (Piecewise) Spherical Objects
We utilize support functions to transform the problem of constructing the convex hull of a finite set of spherical objects into the problem of computing the upper envelope of piecewise linear functions. This approach is particularly suited if the objects are (possibly intersecting) circular arcs in the plane or spheres in three-space.
متن کاملThe piecewise linear-quadratic model for computational convex analysis
A new computational framework for computer-aided convex analysis is proposed and investigated. Existing computational frameworks are reviewed and their limitations pointed out. The class of piecewise linear-quadratic functions is introduced to improve convergence and stability. A stable convex calculus is achieved using symbolic-numeric algorithms to compute all fundamental transforms of convex...
متن کامل